Speculative Parallel Pattern Matching

Parallel Pattern Matching with Scaling

Bit-Parallel Multiple Pattern Matching

Text matching with errors is a regular task in computational biology. We present an extension of the bit-parallel Wu-Manber algorithm [16] to combine several searches for a pattern into a collection of fixed-length words. We further present an OpenCL parallelization of a redundant index on massively parallel multicore processors, within a framework of searching for similarities with seed-based ...

Parallel Bi-dimensional Pattern Matching with Scaling

This paper deals with the problem of bi-dimensional pattern matching with scaling. The problem is to find all occurrences of the m m pattern in the N N text, scaled to all natural multiples. We have proposed an efficient parallel algorithm for this problem on CREW-PRAM with p2 processors. It takes O(N2 p2 ) time.

Parallel and Serial Methods of Pattern Matching

Parallel Vectoring Algorithm for Pattern Matching

The main aim of this study is to propose efficient algorithms for image template matching on parallel machines. To our knowledge there is no a template matching algorithm that converts the template image and all candidate blocks in the source image from two-dimensions into one-dimension. This study proposes a Template Matching Vectoring Algorithm (TMVA) that reduces the amount of data to be ana...